Maximum Flow Routing with Weighted Max-Min Fairness
نویسندگان
چکیده
Max-min is an established fairness criteria for allocating bandwidth for flows. In this work we look at the combined problem of routing and bandwidth allocation such that the flow allocation for each connection will be maximized and fairness will be maintained. We use the weighted extension of the max-min criteria to allocate bandwidth proportionaly to the flows’ demand. Our contribution is an algorithm which, for the first time, solve the combined routing and bandwidth allocation problem for the case where flows are allowed to be splitted along several paths. We use multi commodity flow (MCF) formulation which is solved using linear programming (LP) techniques. These building blocks are used by our algorithm to derive the required optimal routing and allocation.
منابع مشابه
A Tutorial on Max-Min Fairness and its Applications to Routing, Load-Balancing and Network Design
This tutorial is devoted to the notion of Max-Min Fairness (MMF), associated optimization problems, and their applications to multi-commodity flow networks. We first introduce a theoretical background for the MMF problem and discuss its relation to lexicographic optimization. We next present resolution algorithms for the MMF optimization, and then give some applications to telecommunication net...
متن کاملRate Assignment in Micro-Buffered High Speed Networks
Micro-buffered networks are high speed optical packet switched networks, and consist of either nodes with no buffering or nodes with limited buffering. We focus on the case of bufferless nodes, where there is no specific collision resolution mechanisms inside the core. Packet losses inside the core may be frequent, and are dealt with using end-to-end or edgeto-edge coding techniques. In this st...
متن کاملWeighted Fairness in Buffered Crossbar Scheduling
The crossbar is the most popular packet switch architecture. By adding small buffers at the crosspoints, important advantages can be obtained: (1) Crossbar scheduling is simplified. (2) High throughput is achievable. (3) Weighted scheduling becomes feasible. In this paper we study the fairness properties of a buffered crossbar with weighted fair schedulers. We show by means of simulation that, ...
متن کاملCalcul de Routages Equitables dans les Réseaux Internet
In this paper we consider the problem of fair routing in multicommodity networks. We present here an algorithm for calculating fair routing in a network where the available resources are shared among competing flows according to a max-min share criterion. Our main interest is computing optimal routing paths with regard to max-min fairness, in stable and known traffic conditions. It is a linear ...
متن کاملUtility max-min fair resource allocation for communication networks with multipath routing
This paper considers the flow control and resource allocation problem as applied to the generic multipath communication networks with heterogeneous applications. We propose a novel distributed algorithm, show and prove that among all the sources with positive increasing and bounded utilities (no need to be concave) in steady state, the utility max-min fairness is achieved, which is essential fo...
متن کامل